Experiments in Automated Deduction with Condensed Detachment

This paper contains the results of experiments with several search strategies on problems involving condensed detachment The problems are taken from nine di erent logic calculi three versions of the two valued sentential calculus the many valued sentential calculus the implicational calculus the equivalential calculus the R calculus the left group calculus and the right group calculus Each problem was given to the theorem prover Otter and was run with at least three strategies a basic strategy a strategy with a more re ned method for selecting clauses on which to focus and a strategy that uses the re ned selection mechanism and deletes deduced formulas according to some simple rules Two new features of Otter are also presented the re ned method for selecting the next formula on which to focus and a method for controlling memory usage